Scaling Exponential Backoff
نویسندگان
چکیده
منابع مشابه
How to Fix Exponential Backoff
Randomized exponential backoff is a widely deployed technique for coordinating access to a shared resource. A good backoff protocol should, arguably, satisfy three natural properties: (i) it should provide constant throughput, wasting as little time as possible; (ii) it should require few failed access attempts, minimizing the amount of wasted effort; and (iii) it should be robust, continuing t...
متن کاملOn the Stability of Exponential Backoff
Random access schemes for packet networks featuring distributed control require algorithms and protocols for resolving packet collisions that occur as the uncoordinated terminals contend for the channel. A widely used collision resolution protocol is the exponential backoff (EB). New analytical results for the stability of the (binary) EB are given. Previous studies on the stability of the (bin...
متن کاملPerformance Analysis of Binary Exponential Backoff and Improved Backoff for WPAN
The IEEE 802.15.3 medium access control (MAC) is proposed, especially, for wireless personal area network (WPAN) short and high data rates applications, to coordinate the access to the wireless medium among the competing devices. A concept of a geometrically increasing probability distribution for contention process was brought up in the work of Tay et al. (2004) . In this paper, we adopt this ...
متن کاملA Study of Exponential Backoff Mechanisms with two users
We provide a simple method to assess stability and capacity of general Exponential Backoff (EB) mechanisms in the case of two contending stations. We prove that, in the case of Binary EB with balanced traffic, the system is stable for total arrival rates up to λ = 0.6096, which represents also the capacity of the system. Furthermore, we obtain the capacity curve also for the case of unbalanced ...
متن کاملBuffered Aloha with K-Exponential Backoff -- Part II: Delay Analysis
This paper presents the delay analysis for buffered Aloha networks with K-Exponential Backoff. Mean access delay and mean queueing delay are derived and demonstrated via the examples of Geometric Retransmission (K=1) and Exponential Backoff (K=∞). The comparison shows that higher delay is incurred with Geometric Retransmission when the aggregate input rate is small, and the delay gap is enlarge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2019
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3276769